#include<bits/stdc++.h>
struct node{
  int n;
  double count;
};
int cmp(node x, node y)
{
    return x.count>y.count;
}
int cmpn(node x, node y)
{
    return x.n>y.n;
}
int main()
{
    int m,n,k;
    while (scanf("%d%d%d",&m,&n,&k)!=EOF) {
        node *nodes = new node[n];
        for(int im = 0; im < m; im++)
        {
            for(int in = 0; in < n; in++)
            {
                double input;
                scanf("%lf", &input);
                if(im==0)
                    nodes[in]=node{in+1,input};
                else
                    nodes[in].count+=input;
            }
        }
        std::sort(nodes, nodes+n, cmp);
        std::sort(nodes, nodes+k, cmpn);
        for(int i = 0; i < k-1; i++)
        {

            std::cout<<nodes[i].n<<" ";
        }
        std::cout<<nodes[k-1].n<<std::endl;
        delete []nodes;
    }
}
